Optimal stationary behavior for a class of timed continuous Petri nets
نویسندگان
چکیده
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the stationary firing rate for all transitions via linear programming, so as to determine the optimal routing parameters that maximize user-defined linear functions of the firing rates. Finally, we discuss the relations with discrete Petri nets.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملModeling a Bank ATM with Two Directions Places Timed Petri Net (TPN)
A Bank ATM is including controller, card authorization system and a teller unit .This paper explains howthis parts connects together. In this paper will be used of a new mode place in Petri nets. More systemsusually have a complex constructs. ATM will be simulated use of new mode place at this study. The Mainpart of this model is used of T.S.Staines model [1]. We discuss how a simple model of T...
متن کاملM–timed Petri Nets, Priorities, Preemptions, and Performance Evaluation of Systems
In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...
متن کاملA Dioid Linear Algebra Approach to Study a Class of Continuous Petri Nets
Continuous Event Graphs (CEGs), a subclass of Continuous Petri Nets, are defined as the limiting cases of timed event graphs and Timed Event Multigraphs. A set of dioid algebraic linear equations will be inferred as a novel method of analyzing a special class of CEG, if treated the cumulated token consumed by transitions as state-variables, endowed the monotone nondecreasing functions pointwise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 40 شماره
صفحات -
تاریخ انتشار 2004